Òøöö Öö Ò Îîööö Blockin Blockinøøóò
نویسندگان
چکیده
T i m e d P e t r i n e t s a n d t i m e d a u t o m a t a a r e t w o s t a n d a r d m o d e l s f o r t h e a n a l y s i s o f r e a l g t i m e s y s t e m s . W e s t u d y i n t h i s p a p e r t h e i r r e l a t i o n s h i p , a n d p r o v e i n p a r t i c u l a r t h a t t h e y a r e i n c o m p a r a b l e w . r . t . l a n g u a g e e q u i v a l e n c e . I n f a c t , w e s t u d y t h e m o r e g e n e r a l m o d e l o f t i m e d P e t r i n e t s w i t h r e a d g a r c s ( R A u T d P N ) , a l r e a d y i n t r o d u c e d i n [ 1 7 ] , w h i c h u n i fi e s b o t h m o d e l s o f t i m e d P e t r i n e t s a n d o f t i m e d a u t o m a t a , a n d p r o v e t h a t t h e c o v e r a b i l i t y p r o b l e m r e m a i n s d e c i d a b l e f o r t h i s m o d e l . T h e n , w e e s t a b l i s h n u m e r o u s e x p r e s s i v e n e s s r e s u l t s a n d p r o v e t h a t Z e n o b e h a v i o u r s d i s c r i m i n a t e b e t w e e n s e v e r a l s u b g c l a s s e s o f R A u T d P N s . T h i s h a s s u r p r i s i n g c o n s e q u e n c e s o n t i m e d a u t o m a t a , f o r i n s t a n c e o n t h e p o w e r o f n o n g d e t e r m i n i s t i c c l o c k r e s e t s .
منابع مشابه
Òøöö Öö Ò Îîööö Blockin Blockinøøóò on the Complexity of Partial Order Trace Model Checking * Thierry Massart Cédric Meuter
متن کامل
Òøöö Öö Ò Îîööö Blockin Blockinøøóò an Introduction to the Tool Ticc ⋆
This paper is a tutorial introduction to the sociable interface model of [12] and its underlying tool TICC [1]. The paper starts with a survey of the theory of interfaces and then introduces the sociable interface model that is a game-based model with rich communication primitives to facilitate the modeling of software and distributed systems. The model and its main features are then intensivel...
متن کاملÒøöö Öö Ò Îîööö Blockin Blockinøøóò a Lattice Theory for Solving Games of Imperfect Information
In this paper, we propose a fixed point theory to solve games of imperfect information. The fixed point theory is defined on the lattice of antichains of sets of states. Contrary to the classical solution proposed by Reif [Rei84], our new solution does not involve determinization. As a consequence, it is readily applicable to classes of systems that do not admit determinization. Notable example...
متن کاملÒøöö Öö Ò Îîööö Blockin Blockinøøóò
Visibly pushdown automata have been recently introduced by Alur and Madhusudan as a subclass of pushdown automata. This class enjoys nice properties such as closure under all Boolean operations and the decidability of language inclusion. Along the same line, we introduce here visibly pushdown transducers as a subclass of pushdown transducers. We study properties of those transducers and identif...
متن کاملÒøöö Öö Ò Îîööö Blockin Blockinøøóò Expand, Enlarge, and Check New Algorithms for the Coverability Problem of Wsts
In this paper, we present a general algorithmic schema called ‘Expand, Enlarge and Check’ from which new algorithms for the coverability problem of WSTS can be constructed. We show here that our schema allows us to define forward algorithms that decide the coverability problem for several classes of systems for which the Karp and Miller procedure cannot be generalized, and for which no complete...
متن کاملÒøöö Öö Ò Îîööö Blockin Blockinøøóò Robustness and Implementability of Timed Automata
The Almost ASAP semantics is a parameterized semantics for Timed Automata that has been developped in [DDR05] to cope with the reaction delay of the controller. That semantics is implementable provided there exists strictly positive values for the parameters ∆ and ε for which the strategy is correct. In this paper, we define the implementability problem to be the question of the existence of su...
متن کامل